Decomposition of a hypergraph by partial-edge separators
نویسندگان
چکیده
منابع مشابه
Decomposition by maxclique separators
We provide a minimal counterexample to the correctness of an algorithm proposed by R. Tarjan for decomposing a graph by maximal clique separators. We also suggest a modification to that algorithm which not only corrects it but also retains its O(nm) time complexity.
متن کاملHypergraph Partitioning through Vertex Separators on Graphs
The modeling flexibility provided by hypergraphs has drawn a lot of interest from the combinatorial scientific community, leading to novel models and algorithms, their applications, and development of associated tools. Hypergraphs are now a standard tool in combinatorial scientific computing. The modeling flexibility of hypergraphs however, comes at a cost: algorithms on hypergraphs are inheren...
متن کاملEdge-decomposition of topological indices
The topological indices, defined as the sum of contributions of all pairs of vertices (among which are the Wiener, Harary, hyper–Wiener indices, degree distance, and many others), are expressed in terms of contributions of edges and pairs of edges.
متن کاملEdge separators for quasi-binary trees
One wishes to remove k − 1 edges of a vertex-weighted tree T such that the weights of the k induced connected components are approximately the same. How well can one do it ? In this paper, we investigate such k-separator for quasi-binary trees. We show that, under certain conditions on the total weight of the tree, a particular k-separator can be constructed such that the smallest (respectively...
متن کاملedge-decomposition of topological indices
the topological indices, defined as the sum of contributions of all pairs of vertices (among which are the wiener, harary, hyper–wiener indices, degree distance, and many others), are expressed in terms of contributions of edges and pairs of edges.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2000
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(98)00128-5